Implicitization using univariate resultants
نویسندگان
چکیده
Among several implicitization methods, the method based on resultant computation is a simple and direct one, but it often brings extraneous factors which are difficult to remove. This paper studies a class of rational space curves and rational surfaces by implicitization with univariate resultant computations. This method is more efficient than the other algorithms in finding implicit equations for this class of rational curves and surfaces.
منابع مشابه
Hybrid Dixon Resultants
Dixon 1908] describes three distinct homogeneous determinant representations for the resultant of three bivariate polynomials of bidegree (m; n). These Dixon resultants are the determinants of matrices of orders 6mn, 3mn and 2mn, and the entries of these matrices are respectively homogeneous of degrees 1, 2, and 3 in the coeecients of the original three polynomial equations. Here we mix and mat...
متن کاملUsing projection operators in Computer Aided Geometric Design
We give an overview of resultant theory and some of its applications in computer aided geometric design. First, we mention different formulations of resultants, including the projective resultant, the toric resultant, and the residual resultants. In the second part we illustrate these tools, and others projection operators, on typical problems as surface implicitization, inversion, intersection...
متن کاملNumerical stability of surface implicitization
In geometric modelling surfaces can be given essentially in two ways: implicit and parametric form. The automatic transition between the implicit and the parametric representations of surfaces is of fundamental importance. In the literature there are several symbolic/numeric implicitization techniques based on resultants [1], Gröbner–basis [2], moving surfaces [3], linear algebra [4], but the n...
متن کاملLinear complete differential resultants and the implicitization of linear DPPEs
The linear complete differential resultant of a finite set of linear ordinary differential polynomials is defined. We study the computation by linear complete differential resultants of the implicit equation of a system of n linear differential polynomial parametric equations in n− 1 differential parameters. We give necessary conditions to ensure properness of the system of differential polynom...
متن کاملAn Implicitization Algorithm for Rational Surfaces with no Base Points
The computation of the implicit equation of a rational parametric surface is in many applications the first step to deal with. The different methods of implicitization belong to two main classes. The first class of methods relies on classical elimination theory. Iterated resultants in one variable or resultants in several variables are used to compute the implicit form. The computation of the r...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- J. Systems Science & Complexity
دوره 23 شماره
صفحات -
تاریخ انتشار 2010